On Digraphs with Non-derogatory Adjacency Matrix
نویسندگان
چکیده
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similarity invariants of their adjacency matrices respectively.
منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملNormally Regular Digraphs
A normally regular digraph with parameters (v, k, λ, μ) is a directed graph on v vertices whose adjacency matrix A satisfies the equation AAt = kI + λ(A + At) + μ(J − I − A − At). This means that every vertex has out-degree k, a pair of nonadjacent vertices have μ common out-neighbours, a pair of vertices connected by an edge in one direction have λ common out-neighbours and a pair of vertices ...
متن کاملGraphs of unitary matrices
The support of a matrix M is the (0, 1)-matrix with ij-th entry equal to 1 if the ij-th entry of M is non-zero, and equal to 0, otherwise. The digraph whose adjacency matrix is the support of M is said to be the digraph of M . This paper observes some structural properties of digraphs and Cayley digraphs, of unitary matrices. We prove that a group generated by two elements has a set of generato...
متن کاملShort proofs for interval digraphs
We give short proofs of the adjacency matrix characterizations of interval digraphs and unit interval digraphs.
متن کاملClasses of Interval Digraphs and 0 , 1 -
We consider a hierarchy of four classes of interval digraphs, or equivalently four classes of 0,1-matrics. We provide forbidden submatrix characterizations separating the successive classes. The largest class is the set of (adjacency matrices of) interval digraphs; the smallest is the set of (adjacency matrices of) unit interval digraphs.
متن کامل